Spectrum of large random reversible Markov chains: two examples
نویسندگان
چکیده
We take on a Random Matrix theory viewpoint to study the spectrum of certain reversible Markov chains in random environment. As the number of states tends to infinity, we consider the global behavior of the spectrum, and the local behavior at the edge, including the so called spectral gap. Results are obtained for two simple models with distinct limiting features. The first model is built on the complete graph while the second is a birth-and-death dynamics. Both models give rise to random matrices with non independent entries.
منابع مشابه
The L2-cutoff for reversible Markov processes
We consider the problem of proving the existence of an L2-cutoff for families of ergodic Markov processes started from given initial distributions and associated with reversible (more, generally, normal) Markov semigroups. This includes classical examples such as families of finite reversible Markov chains and Brownian motion on compact Riemannian manifolds. We give conditions that are equivale...
متن کاملBounds on the L2 Spectrum for Markov Chains and Markov Processes: a Generalization of Cheeger's Inequality
We prove a general version of Cheeger's inequality for discretetime Markov chains and continuous-time Markovian jump processes, both reversible and nonreversible, with general state space. We also prove a version of Cheeger's inequality for Markov chains and processes with killing. As an application, we prove L2 exponential convergence to equilibrium for random walk with inward drift on a class...
متن کاملG-PCCA: Spectral Clustering for Non-reversible Markov Chains
Spectral clustering methods are based on solving eigenvalue problems for the identification of clusters, e.g., the identification of metastable subsets of a Markov chain. Usually, real-valued eigenvectors are mandatory for this type of algorithms. The Perron Cluster Analysis (PCCA+) is a well-known spectral clustering method of Markov chains. It is applicable for reversible Markov chains, becau...
متن کاملConvergence Rates of Markov Chains
1. Orientation 1 1.1. Example 1: Random-to-Top Card Shuffling 1 1.2. Example 2: The Ehrenfest Urn Model of Diffusion 2 1.3. Example 3: Metropolis-Hastings Algorithm 4 1.4. Reversible Markov Chains 5 1.5. Exercises: Reversiblity, Symmetries and Stationary Distributions 8 2. Coupling 9 2.1. Coupling and Total Variation Distance 9 2.2. Coupling Constructions and Convergence of Markov Chains 10 2.3...
متن کاملRandom Walks on Infinite Graphs and Groups — a Survey on Selected Topics
Contents 1. Introduction 2 2. Basic definitions and preliminaries 3 A. Adaptedness to the graph structure 4 B. Reversible Markov chains 4 C. Random walks on groups 5 D. Group-invariant random walks on graphs 6 E. Harmonic and superharmonic functions 6 3. Spectral radius, amenability and law of large numbers 6 A. Spectral radius, isoperimetric inequalities and growth 6 B. Law of large numbers 9 ...
متن کامل